DDOMAIN: Dividing structures into domains using a normalized domain-domain interaction profile.

نویسندگان

  • Hongyi Zhou
  • Bin Xue
  • Yaoqi Zhou
چکیده

Dividing protein structures into domains is proven useful for more accurate structural and functional characterization of proteins. Here, we develop a method, called DDOMAIN, that divides structure into DOMAINs using a normalized contact-based domain-domain interaction profile. Results of DDOMAIN are compared to AUTHORS annotations (domain definitions are given by the authors who solved protein structures), as well as to popular SCOP and CATH annotations by human experts and automatic programs. DDOMAIN's automatic annotations are most consistent with the AUTHORS annotations (90% agreement in number of domains and 88% agreement in both number of domains and at least 85% overlap in domain assignment of residues) if its three adjustable parameters are trained by the AUTHORS annotations. By comparison, the agreement is 83% (81% with at least 85% overlap criterion) between SCOP-trained DDOMAIN and SCOP annotations and 77% (73%) between CATH-trained DDOMAIN and CATH annotations. The agreement between DDOMAIN and AUTHORS annotations goes beyond single-domain proteins (97%, 82%, and 56% for single-, two-, and three-domain proteins, respectively). For an "easy" data set of proteins whose CATH and SCOP annotations agree with each other in number of domains, the agreement is 90% (89%) between "easy-set"-trained DDOMAIN and CATH/SCOP annotations. The consistency between SCOP-trained DDOMAIN and SCOP annotations is superior to two other recently developed, SCOP-trained, automatic methods PDP (protein domain parser), and DomainParser 2. We also tested a simple consensus method made of PDP, DomainParser 2, and DDOMAIN and a different version of DDOMAIN based on a more sophisticated statistical energy function. The DDOMAIN server and its executable are available in the services section on http://sparks.informatics.iupui.edu.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovering Domains Mediating Protein Interactions

Background: Protein-protein interactions do not provide any direct information re‌garding the domains within the proteins that mediate the interactions. The majority of proteins are multi domain proteins and the interaction between them is often defined by the pairs of their domains. Most of the former studies focus only on interacting do‌main pairs. However they do not consider the in...

متن کامل

Image alignment via kernelized feature learning

Machine learning is an application of artificial intelligence that is able to automatically learn and improve from experience without being explicitly programmed. The primary assumption for most of the machine learning algorithms is that the training set (source domain) and the test set (target domain) follow from the same probability distribution. However, in most of the real-world application...

متن کامل

Determination of Stability Domains for Nonlinear Dynamical Systems Using the Weighted Residuals Method

Finding a suitable estimation of stability domain around stable equilibrium points is an important issue in the study of nonlinear dynamical systems. This paper intends to apply a set of analytical-numerical methods to estimate the region of attraction for autonomous nonlinear systems. In mechanical and structural engineering, autonomous systems could be found in large deformation problems or c...

متن کامل

A note on the problem when FS-domains coincide with RB-domains

In this paper, we introduce the notion of super finitely separating functions which gives a characterization of RB-domains. Then we prove that FS-domains and RB-domains are equivalent in some special cases by the following three claims: a dcpo is an RB-domain if and only if there exists an approximate identity for it consisting of super finitely separating functions; a consistent join-semilatti...

متن کامل

Quasi-Primary Decomposition in Modules Over Proufer Domains

In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Protein science : a publication of the Protein Society

دوره 16 5  شماره 

صفحات  -

تاریخ انتشار 2007